A Novel Distance-based Classifier Using Convolution Kernels and Euclidean Embeddings

نویسندگان

  • Zhihua Zhang
  • James T. Kwok
  • Dit-Yan Yeung
  • Wanqiu Wang
چکیده

Distance-based classification methods such as the nearest-neighbor and k-nearest-neighbor classifiers have to rely on a metric or distance measure between points in the input space. For many applications, Euclidean distance in the input space is not a good choice and hence more complicated distance measures have to be used. In this paper, we propose a novel kernel-based method that achieves Euclidean embedding by ensuring that the feature space is always Euclidean. Thus, Euclidean distance-based classification methods can be applied in the feature space. Unlike typical kernels which correspond to a nonlinear mapping from the input space, our kernel function corresponds to a nonlinear mapping from the joint space incorporating both the input and class label spaces. The kernel function, which can be seen as a convolution kernel formed from the tensor product kernel and the direct sum kernel, tends to increase the separability between classes. We have applied our new classification method to some face recognition benchmark datasets. Our method is significantly faster than other face recognition methods and yet it can deliver comparable classification accuracy.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Renal Cancer Cell Classification Using Generative Embeddings and Information Theoretic Kernels

In this paper, we propose a hybrid generative/discriminative classification scheme and apply it to the detection of renal cell carcinoma (RCC) on tissue microarray (TMA) images. In particular we use probabilistic latent semantic analysis (pLSA) as a generative model to perform generative embedding onto the free energy score space (FESS). Subsequently, we use information theoretic kernels on the...

متن کامل

Relaxed Exponential Kernels for Unsupervised Learning

Many unsupervised learning algorithms make use of kernels that rely on the Euclidean distance between two samples. However, the Euclidean distance is optimal for Gaussian distributed data. In this paper, we relax the global Gaussian assumption made by the Euclidean distance, and propose a locale Gaussian modelling for the immediate neighbourhood of the samples, resulting in an augmented data sp...

متن کامل

Kernel Choice and Classifiability for RKHS Embeddings of Probability Distributions

Embeddings of probability measures into reproducing kernel Hilbert spaces have been proposed as a straightforward and practical means of representing and comparing probabilities. In particular, the distance between embeddings (the maximum mean discrepancy, or MMD) has several key advantages over many classical metrics on distributions, namely easy computability, fast convergence and low bias of...

متن کامل

Multi-Scale Kernels Using Random Walks

We introduce novel multiscale kernels using the random walk framework and derive corresponding embeddings and pairwise distances. The fractional moments of the rate of continuous time random walk (equivalently diffusion rate) are used to discover higher order kernels (or similarities) between pair of points. The formulated kernels are isometry, scale, and tessellation invariant, can be made glo...

متن کامل

یادگیری نیمه نظارتی کرنل مرکب با استفاده از تکنیک‌های یادگیری معیار فاصله

Distance metric has a key role in many machine learning and computer vision algorithms so that choosing an appropriate distance metric has a direct effect on the performance of such algorithms. Recently, distance metric learning using labeled data or other available supervisory information has become a very active research area in machine learning applications. Studies in this area have shown t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002